Access-Ordered Indexes
نویسندگان
چکیده
Search engines are an essential tool for modern life. We use them to discover new information on diverse topics and to locate a wide range of resources. The search process in all practical search engines is supported by an inverted index structure that stores all search terms and their locations within the searchable document collection. Inverted indexes are highly optimised, and significant work has been undertaken over the past fifteen years to store, retrieve, compress, and understand heuristics for these structures. In this paper, we propose a new self-organising inverted index based on past queries. We show that this access-ordered index improves query evaluation speed by 25%–40% over a conventional, optimised approach with almost indistinguishable accuracy. We conclude that access-ordered indexes are a valuable new tool to support fast and accurate web search.
منابع مشابه
Construction of Tree-Based Indexes for Level-Contiguous Buffering Support
In multimedia databases, the spatial index structures based on trees (like R-tree, M-tree) have been proved to be efficient and scalable for low-dimensional data retrieval. However, if the data dimensionality is too high, the hierarchy of nested regions (represented by the tree nodes) becomes spatially indistinct. Hence, the query processing deteriorates to inefficient index traversal (in terms...
متن کاملRP*: A Family of Order Preserving Scalable Distributed Data Structures
Hash-based scalable distributed data structures (SDDSs), like LH* and DDH, for networks of intcmonnected ampllters (multicomputers) were shown to open new perspectives for fik management. We prcpose a family of ordered SDDSs, called P, providing for ordered and dynamic files on mutticomputers, and thus for more etlicknt pmeessing of range queries and of ordered traversak of files The basic algo...
متن کاملRP * : A Family of Order - Preserving Scalable Distributed Data Structures
Hash-based scalable distributed data structures (SDDSs), like LH* and DDH, for networks of interconnected computers (multicomputers) were shown to open new perspectives for file management. We propose a family of ordered SDDSs, called RP*, providing for ordered and dynamic files on multicomputers, and thus for more efficient processing of range queries and of ordered traversals of files. The ba...
متن کاملDefinition of cross-domain indexes and ordering functions in relational algebra and its usage in relational database management systems
In this thesis, a mathematical model that describes a “Unique Constraint Domain” is defined. Following, the “Ordered Unique Constraint Domain” is also mathematically defined. With those definitions, a cross-domain ordering is also defined. Then it is shown that relationships between tables in a Relational Database Management System can be defined in other forms than the usual ways, using cross-...
متن کاملNatural Language Text Segmentation Techniques Applied To The Automatic Compilation Of Printed Subject Indexes And For Online Database Access
The nature of the problem and earlier approaches to the automatic compilation of printed subject indexes are reviewed and illustrated. A simple method is described for the de~ection of semantically self-contained word phrase segments in title-like texts. The method is based on a predetermined list of acceptable types of nominative syntactic patterns which can be recognized using a small domain-...
متن کامل